When Can Graph Hyperbolicity be Computed in Linear Time?
نویسندگان
چکیده
منابع مشابه
When Can Graph Hyperbolicity Be Computed in Linear Time?
Hyperbolicity measures, in terms of (distance) metrics, how close a given graph is to being a tree. Due to its relevance in modeling real-world networks, hyperbolicity has seen intensive research over the last years. Unfortunately, the best known practical algorithms for computing the hyperbolicity number of a n-vertex graph have running time O(n). Exploiting the framework of parameterized comp...
متن کاملTenacity and some other Parameters of Interval Graphs can be computed in polynomial time
In general, computation of graph vulnerability parameters is NP-complete. In past, some algorithms were introduced to prove that computation of toughness, scattering number, integrity and weighted integrity parameters of interval graphs are polynomial. In this paper, two different vulnerability parameters of graphs, tenacity and rupture degree are defined. In general, computing the tenacity o...
متن کاملDecision Making under Interval Uncertainty: What Can and What Cannot Be Computed in Linear Time and in Real Time
In engineering, we constantly need to make decisions: which design to select, which parameters to select for this design, etc. The traditional approach to decision making is based on the assumption that we know all possible consequences of each alternative, and we know the probability of each such consequence. Under this assumption, we can describe a rational decision-making process: to each po...
متن کاملCan A Maximum Flow be Computed on o(nm) Time?
A b s t r a c t. We show that a maximum flow in a network with n vertices can be computed deterministically in O(n3/logn) time on a uniform-cost RAM. For dense graphs, this improves the previous best bound of O(n3). The bottleneck in our algorithm is a combinatorial problem on (unweighted) graphs. The number of operations executed on flow variables is O(nS/3(log n)4/3), in contrast with f~(nm) ...
متن کاملWhat Can Be Computed Locally?
1 Summary The paper [1] deals with locality on several levels: It introduces a model for distributed computations and the notion of locally checkable labelings (LCLs). It proves properties about algorithms for locally checkable labeling problems. Two algorithms are analyzed in detail: One for the Weak Coloring problem and one for the Formal Dining Philosophers problem. The paper shows fundament...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithmica
سال: 2018
ISSN: 0178-4617,1432-0541
DOI: 10.1007/s00453-018-0522-6